Fast and Accurate Simulation of Gravitational Field of Irregular-shaped Bodies using Polydisperse Sphere Packings
نویسندگان
چکیده
Currently, interest in space missions to small bodies (e.g., asteroids) is increasing, both scientifically and commercially. One of the important aspects of these missions is to test the navigation, guidance, and control algorithms. The most cost and time efficient way to do this is to simulate the missions in virtual testbeds. To do so, a physically-based simulation of the small bodies’ physical properties is essential. One of the most important physical properties, especially for landing operations, is the gravitational field, which can be quite irregular, depending on the shape and mass distribution of the body. In this paper, we present a novel algorithm to simulate gravitational fields for small bodies like asteroids. The main idea is to represent the small body’s mass by a polydisperse sphere packing. This allows for an easy and efficient parallelization. Our GPU-based implementation outperforms traditional methods by more than two orders of magnitude while achieving a similar accuracy. CCS Concepts •Computing methodologies → Real-time simulation; •Human-centered computing → Virtual reality; •Applied computing → Aerospace;
منابع مشابه
Fast Sphere Packings with Adaptive Grids on the GPU
Polydisperse sphere packings are a new and very promising data representation for several fundamental problems in computer graphics and VR such as collision detection and deformable object simulation. In this paper we present acceleration techniques to compute such sphere packings for arbitrary 3D objects efficiently on the GPU. To do that, we apply different refinement methods for adaptive gri...
متن کاملComputer generation of dense polydisperse sphere packings
We present an extension of the Lubachevsky and Stillinger @J. Stat. Phys. 60, 561 ~1990!# packing algorithm to generate packings of polydisperse spheres. The original Lubachevsky–Stillinger algorithm is a nonequilibrium protocol that allows a set of monodisperse spheres to grow slowly over time eventually reaching an asymptotic maximum packing fraction. We use this protocol to pack polydisperse...
متن کاملOn the jamming phase diagram for frictionless hard-sphere packings.
We computer-generated monodisperse and polydisperse frictionless hard-sphere packings of 10(4) particles with log-normal particle diameter distributions in a wide range of packing densities φ (for monodisperse packings φ = 0.46-0.72). We equilibrated these packings and searched for their inherent structures, which for hard spheres we refer to as closest jammed configurations. We found that the ...
متن کاملStatistical geometry of particle packings. I. Algorithm for exact determination of connectivity, volume, and surface areas of void space in monodisperse and polydisperse sphere packings
Packings of spheres serve as useful models of the geometry of many physical systems; in particular, the description of the void region in such packings ~the region not occupied by the spheres! is crucial in many studies. The void region is, in general, composed of disconnected cavities. We present an algorithm for decomposing void space into cavities and determining the exact volumes and surfac...
متن کاملDense regular packings of irregular nonconvex particles.
We present a new numerical scheme to study systems of nonconvex, irregular, and punctured particles in an efficient manner. We employ this method to analyze regular packings of odd-shaped bodies, both from a nanoparticle and from a computational geometry perspective. Besides determining close-packed structures for 17 irregular shapes, we confirm several conjectures for the packings of a large s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017